Analog Circuits Implementation of Connectionist Network for Minimax Problems
نویسندگان
چکیده
It is a well established result that nding the solution to the minimum spanning tree(MST) problem is an easy task if the solution to the all-pairs minimax path problem(MPP) is known. As the MST problem has a broad range of applications, a fast solution to the problem is very beneecial. Previous work has established a connectionist architecture based on the binary relation inference network which can be implemented as a uniform feedback arrangement using conventional maximum and minimum circuits as basic building blocks. Although the parallel and asynchronous operating nature of the network promises a solution time independent of problem size, limitations in practical implementation platfroms may not help to realize such merit. This paper investigates a particular implemenetation of the aforementioned network for nding the MST of a 10-node graph using commercially available electronic components. The propagation delay of signals and accuracy of the converged network output are studied as well as the discovered instability issue are discussed.
منابع مشابه
Analog and Vlsi Implementation of Connectionist Network for Minimum Spanning Tree Problems
| We describe a connectionist architecture which shows promise in obtaining the global optimal solution to the classical minimum spanning tree problem in a time independent of the problem size. Using commonly available analogue electronic components, a network prototype was found to give the global optimal solution within the microseconds range. Simulation results and limiting factors of the pe...
متن کاملA Connectionist Network for Dynamic Programming Problems
Dynamic programmingis well-known as a powerful modeling techniquefor dealing with the issue of making optimal decisions sequentially. Many practical problems, such as nding shortest paths in route planning, multi-stage optimal control, can be formulated as special cases of the general sequential decision process. This paper proposes a connectionist network architecture, called the binary relati...
متن کاملANALOG AND VLSI IMPLEMENTATION OF CONNECTIONIST NETWORK FOR MINIMUM SPANNING TREE PROBLEMS - Microelectronics and VLSI, 1995. TENCON '95., IEEE Region 10 International Conference on
We describe a connectionist architecture which shows promise in obtaining the global optimal solution t o the classical minimum spanning tree problem in a time independent of the problem size. Using commonly available analogue electronic components, a network prototype was found to give the global optimal solution within the microseconds range. Simulation results and limiting factors of the per...
متن کاملModeling and Simulation of Substrate Noise in Mixed-Signal Circuits Applied to a Special VCO
The mixed-signal circuits with both analog and digital blocks on a single chip have wide applications in communication and RF circuits. Integrating these two blocks can cause serious problems especially in applications requiring fast digital circuits and high performance analog blocks. Fast switching in digital blocks generates a noise which can be introduced to analog circuits by the common su...
متن کاملHardware Implementation of a Unified Framework for Connectionist Models
A novel approach and trend on VLSI implementation of a unified framework for hardware supporting of connectionist algorithms is presented in this work. An analog hybrid neural network implemented in VLSI hardware is designed, fabricated, and tested for this purpose.
متن کامل